Dividing Splittable Goods Evenly and With Limited Fragmentation
نویسندگان
چکیده
منابع مشابه
Dividing goods and bads under additive utilities
When utilities are additive, we uncovered in our previous paper [1] many similarities but also surprising differences in the behavior of the familiar Competitive rule (with equal incomes), when we divide (private) goods or bads.The rule picks in both cases the critical points of the product of utilities (or disutilities) on the efficiency frontier, but there is only one such point if we share g...
متن کاملDividing goods or bads under additive utilities
We compare the Egalitarian Equivalent and the Competitive Equilibrium with Equal Incomes rules to divide a bundle of goods (heirlooms) or a bundle of bads (chores). For goods the Competitive division fares better, as it is Resource Monotonic, and makes it harder to strategically misreport preferences. But for bads, the Competitive rule, unlike the Egalitarian one, is multivalued, harder to comp...
متن کاملSocial Fragmentation, Public Goods and Elections: Evidence from China∗
This study examines how the economic e ects of elections in rural China depend on voter heterogeneity, as captured by religious fractionalization. We rst document religious composition and the introduction of village-level elections for a nearly nationally representative sample of over two hundred villages. Then, we examine the interaction e ect of heterogeneity and the introduction of election...
متن کاملOn Packing Splittable Items with Cardinality Constraints
This paper continues the study of the the allocation of memory to processors in a pipeline problem. This problem can be modeled as a variation of bin packing where each item corresponds to a different type and the normalized weight of each item can be greater than 1, which is the size of a bin. Furthermore, in this problem, items may be split arbitrarily, but each bin may contain at most k type...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2019
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-019-00643-z